Semantic Techniques for Deriving Coinductive Characterizations of Observational Equivalences for -calculi ?
نویسنده
چکیده
Coinductive (applicative) characterizations of various observational congruences which arise in the semantics of-calculus, for various reduction strategies, are discussed. Two semantic techniques for establishing the coincidence of the applicative and the contextual equivalences are analyzed. The rst is based on intersection types, the second is based on a mixed induction-coinduction principle.
منابع مشابه
A Uniform Syntactical Method for ProvingCoinduction Principles in - calculi ?
Coinductive characterizations of various observational con-gruences which arise in the semantics of-calculus, when-terms are evaluated according to various reduction strategies, are discussed. We analyze and extend to non-lazy strategies, both deterministic and non-deterministic, Howe's congruence candidate method for proving the coincidence of the applicative (bisimulation) and the contextual ...
متن کاملCoinductive characterizations of applicative structures
We discuss new ways of characterizing, as maximal xed points of monotone operators, observational congruences on-terms and, more in general, equivalences on applicative structures. These characterizations naturally induce new forms of coinduction principles, for reasoning on program equivalences, which are not based on Abramsky's applicative bisimulation. We discuss in particular, what we call,...
متن کاملSemantical Analysis of Perpetual Strategies in -calculus ?
Perpetual strategies in-calculus are analyzed from a semantical perspective. This is achieved using suitable denotational models, computationally adequate with respect to the observational (operational) equivalence, p , induced by perpetual strategies. A necessary and suucient condition is given for an !-algebraic lattice, isomorphic to the space of its strict continuous self-maps, to be comput...
متن کاملDeriving Weak Bisimulation Congruences from Reduction Systems
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition systems (LTSs) whose labels model the possible interactions of a process with the environment; (ii) their abstract semantics is conveniently expressed by observational congruences. However, many current-day process calcul...
متن کاملBisimilarity for the Region Calculus
A region calculus is a programming language calculus with explicit instrumentation for memory management. Every value is annotated with a region in which it is stored and regions are allocated and deallocated in a stack-like fashion. The annotations can be statically inferred by a type and effect system, making a region calculus suitable as an intermediate language for a compiler of statically ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997